Optimal roughening of convex bodies

نویسنده

  • Alexander Plakhov
چکیده

A body moves in a rarefied medium composed of point particles at rest. The particles make elastic reflections when colliding with the body surface, and do not interact with each other. We consider a generalization of Newton’s minimal resistance problem: given two bounded convex bodies C1 and C2 such that C1 ⊂ C2 ⊂ R and ∂C1 ∩∂C2 = ∅, minimize the resistance in the class of connected bodies B such that C1 ⊂ B ⊂ C2. We prove that the infimum of resistance is zero; that is, there exist ”almost perfectly streamlined” bodies. Mathematics subject classifications: 37D50, 49Q10

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Billiards, scattering by rough obstacles and optimal mass transportation

This article presents a brief exposition of recent results of the author on billiard scattering by rough obstacles. We define the notion of a rough body and give a characterization of scattering by rough bodies. Then we define the resistance of a rough body; it can be interpreted as the aerodynamic resistance of the somersaulting body moving through a rarefied medium. We solve the problems of m...

متن کامل

A numerical approach for optimal control model of the convex semi-infinite programming

In this paper, convex semi-infinite programming is converted to an optimal control model of neural networks and the optimal control model is solved by iterative dynamic programming method. In final, numerical examples are provided for illustration of the purposed method.

متن کامل

Asymptotic approximation of smooth convex bodies by general polytopes

For the optimal approximation of convex bodies by inscribed or circumscribed polytopes there are precise asymptotic results with respect to different notions of distance. In this paper we want to derive some results on optimal approximation without restricting the polytopes to be inscribed or circumscribed. Let Pn and P(n) denote the set of polytopes with at most n vertices and n facets, respec...

متن کامل

New analysis of the sphere covering problems and optimal polytope approximation of convex bodies

In this paper, we show that both sphere covering problems and optimal polytope approximation of convex bodies are related to optimal Delaunay triangulations, which are the triangulations minimizing the interpolation error between function ‖x‖2 and its linear interpolant based on the underline triangulations. We then develop a new analysis based on the estimate of the interpolation error to get ...

متن کامل

Optimal convex combinations bounds of centrodial and harmonic means for logarithmic and identric means

We find the greatest values $alpha_{1} $ and $alpha_{2} $, and the least values $beta_{1} $ and $beta_{2} $ such that the inequalities $alpha_{1} C(a,b)+(1-alpha_{1} )H(a,b)

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011